Primitive lattice points in convex planar domains

Primitive Lattice Points in Starlike

This article is concerned with the number B D (x) of integer points with relative prime coordinates in p x D, where x is a large real variable and D is a starlike set in the Euclidean plane. Assuming the truth of the Riemann Hypothesis, we establish an asymptotic formula for B D (x). Applications to certain special geometric and arithmetic problems are discussed .

Lattice points in large convex bodies , II

Random Points and Lattice Points in Convex Bodies

Assume K ⊂ Rd is a convex body and X is a (large) finite subset of K. How many convex polytopes are there whose vertices belong to X? Is there a typical shape of such polytopes? How well does the maximal such polytope (which is actually the convex hull of X) approximate K? We are interested in these questions mainly in two cases. The first is when X is a random sample of n uniform, independent ...

Random points and lattice points in convex bodies

We write K or Kd for the set of convex bodies in Rd, that is, compact convex sets with nonempty interior in Rd. Assume K ∈ K and x1, . . . , xn are random, independent points chosen according to the uniform distribution in K. The convex hull of these points, to be denoted by Kn, is called a random polytope inscribed in K. Thus Kn = [x1, . . . , xn] where [S] stands for the convex hull of the se...

Inequalities for Lattice Constrained Planar Convex Sets

Every convex set in the plane gives rise to geometric functionals such as the area, perimeter, diameter, width, inradius and circumradius. In this paper, we prove new inequalities involving these geometric functionals for planar convex sets containing zero or one interior lattice point. We also conjecture two results concerning sets containing one interior lattice point. Finally, we summarize k...